Computing optimal assignments for residual network reliability
نویسندگان
چکیده
منابع مشابه
Optimal Link Assignments for All-Terminal Network Reliability
Probabilistic networks whose links are subject to failure have been extensively studied in the literature. Their reliability is regarded as the network’s ability to continue operation after failures have occurred. We consider the allterminal reliability measure, defined as the probability that the network remains connected after failures. Previous work on this model assumes uniform failures pro...
متن کاملQoS and Reliability Models for Network Computing
We present a taxonomy of the agents involved in network computing, introduce models capable to describe different levels of reliability and Quality of Service required by a service contract and discuss architectural requirements for each model. Background The tenn network computing is rather vague, it implies a collection of heterogeneous computing and communication systems capable to provide a...
متن کاملThe Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem is either polynomial time solvable or complete for OptP . We also consider the problem of deciding if in the optimal assignment the largest variable gets val...
متن کاملOptimal Reconfiguration of Distribution Network for Power Loss Reduction and Reliability Improvement Using Bat Algorithm
In power systems, reconfiguration is one of the simplest and most low-cost methods to reach many goals such as self-healing, reliability improvement, and power loss reduction, without including any additional components. Regarding the expansion of distribution networks, communications become more complicate and the number of parameters increases, which makes the reconfiguration problem infeasib...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)89164-0